A New Method for Inferring Hidden Markov Models from Noisy Time Sequences

نویسندگان

  • David Kelly
  • Mark Dillingham
  • Andrew Hudson
  • Karoline Wiesner
چکیده

We present a new method for inferring hidden Markov models from noisy time sequences without the necessity of assuming a model architecture, thus allowing for the detection of degenerate states. This is based on the statistical prediction techniques developed by Crutchfield et al. and generates so called causal state models, equivalent in structure to hidden Markov models. The new method is applicable to any continuous data which clusters around discrete values and exhibits multiple transitions between these values such as tethered particle motion data or Fluorescence Resonance Energy Transfer (FRET) spectra. The algorithms developed have been shown to perform well on simulated data, demonstrating the ability to recover the model used to generate the data under high noise, sparse data conditions and the ability to infer the existence of degenerate states. They have also been applied to new experimental FRET data of Holliday Junction dynamics, extracting the expected two state model and providing values for the transition rates in good agreement with previous results and with results obtained using existing maximum likelihood based methods. The method differs markedly from previous Markov-model reconstructions in being able to uncover truly hidden states.

منابع مشابه

A New Method for Inferring Hidden Markov Models from Noisy Time Sequences - Supporting Information

A New Method for Inferring Hidden Markov Models from Noisy Time Sequences Supporting Information David Kelly1,∗, Mark Dillingham, Andrew Hudson, Karoline Wiesner 1 School of Mathematics, University of Bristol, Bristol, UK 2 School of Biochemistry, University of Bristol, Bristol, UK 3 Department of Chemistry, University of Leicester, Leicester, UK 4 School of Mathematics, University of Bristol, ...

متن کامل

Decoding Coalescent Hidden Markov Models in Linear Time

In many areas of computational biology, hidden Markov models (HMMs) have been used to model local genomic features. In particular, coalescent HMMs have been used to infer ancient population sizes, migration rates, divergence times, and other parameters such as mutation and recombination rates. As more loci, sequences, and hidden states are added to the model, however, the runtime of coalescent ...

متن کامل

A generalization of Profile Hidden Markov Model (PHMM) using one-by-one dependency between sequences

The Profile Hidden Markov Model (PHMM) can be poor at capturing dependency between observations because of the statistical assumptions it makes. To overcome this limitation, the dependency between residues in a multiple sequence alignment (MSA) which is the representative of a PHMM can be combined with the PHMM. Based on the fact that sequences appearing in the final MSA are written based on th...

متن کامل

Inferring State Sequences for Non-linear Systems with Embedded Hidden Markov Models

We describe a Markov chain method for sampling from the distribution of the hidden state sequence in a non-linear dynamical system, given a sequence of observations. This method updates all states in the sequence simultaneously using an embedded Hidden Markov Model (HMM). An update begins with the creation of “pools” of candidate states at each time. We then define an embedded HMM whose states ...

متن کامل

The Classification of Noisy Sequences Generated by Similar HMMs

The method for classification performance improvement using hidden Markov models (HMM) is proposed. The k-nearest neighbors (kNN) classifier is used in the feature space produced by these HMM. Only the similar models with the noisy original sequences assumption are discussed. The research results on simulated data for two-class classification problem are presented.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

متن کامل
عنوان ژورنال:

دوره 7  شماره 

صفحات  -

تاریخ انتشار 2012